prefix length

The route finding function adopts Trie-based Routing Table offered by Intel ￡? and realizes Longest prefix Length match algorithm of 32-bit IP address.

路由查找功能采用Intel提供的TRIE表结构，实现32位IP地址最长前缀匹配算法。

互联网摘选

Different from the bit-by-bit matching algorithms basd on Radix Trie, or the algorithms based on prefix-length binary-search, it makes the IP destination address match the Trie using binary-search method. And it uses parts of the destination IP address as index to avoid Hash functions.

不同于Radix Trie算法的逐一比特进行比较和对前缀长度进行二分搜索的路由查找，BSTrie采用二分法将IP目的地址与Trie进行匹配，并用部分IP目的地址做索引避免了使用Hash函数。

互联网摘选

Time-domain equalizer ( TEQ) is an effective technique to combat ISI caused by inadequate circular prefix ( CP) length in OFDM systems.

在OFDM系统中，时域均衡器用来抵消因循环前缀长度不足而引起的码间串扰。

互联网摘选

Reduction of the distortion caused by insufficient cyclic prefix length for DMT modulation system

消除DMT调制中循环前缀长度不足引起的失真

互联网摘选

Results show that the circle prefix which has arbitrary length can increase the quality of received eye diagram and improve the dispersion tolerance. The power equalization has been used to eliminate the performance differences of channels.

仿真结果表明，循环前缀的插入提高了眼图的性能、改善了色散容限；针对不同子载波进行功率均衡能够有效减小信道间的性能差异。

互联网摘选

High speed IP routing lookups based on segments of prefix length distributions

一种分段式高速IP路由查找方法

互联网摘选

The prefixes stored in TCAM are in descending order according to the prefix length to meet the longest prefix matching.

存储在TCAM的前缀也是按照长度降序排列的，以满足最长前缀查询。

互联网摘选

We buildup three hash tables of the prefix length belongs to 8,16 and 24 first, and then build up multibit-trie which deals with rest 8 bits.

我们针对IPv4地址，首先建立前缀长度为8、16和24的3张hash表，在此基础上，再分别针对不同长度的前缀建立最多只涉及其余8比特的多分支Trie树。

互联网摘选

In addition, we proved that a maximal prefix code with finite length that contains the alphabet in X must be a maximal code.

同时，证明了满足含有X中字母且长度有限的极大前缀码必是极大码。

互联网摘选